1043 Is It a Binary Search Tree (25 分) + 测试注意点

17 篇文章 0 订阅
10 篇文章 0 订阅

题目描述:

A Binary Search Tree (BST) is recursively defined as a binary tree which has the following properties:

The left subtree of a node contains only nodes with keys less than the node’s key.
The right subtree of a node contains only nodes with keys greater than or equal to the node’s key.
Both the left and right subtrees must also be binary search trees.
If we swap the left and right subtrees of every node, then the resulting tree is called the Mirror Image of a BST.

Now given a sequence of integer keys, you are supposed to tell if it is the preorder traversal sequence of a BST or the mirror image of a BST.
(……)

问题解决:

  1. 认为只有一个节点是BST
    测试点:
    1
    1
    输出:
    NO
  2. 输出时行内不能有多余的空格,整体不能有多余的行

试着输出了一下,第1、7个测试点答案是NO,其他是YES
以下代码过不了第4个测试点

#include<iostream>
#include<fstream>
#include<queue>
#include<vector>
#include<algorithm>
#define MAX 100
using namespace std;

struct Node{
    Node* left= nullptr;
    Node* right= nullptr;
    int data;
};

Node* newNode(int data){
    Node* node = new Node;
    node->data = data;
    node->left=node->right= nullptr;
    return node;
}

int n;

void insert(Node* &root, int data){
    if(root== nullptr){
        root= newNode(data);
        return;
    }
    if(root->data<=data) {
        insert(root->right, data);
    } else {
        insert(root->left, data);
    }
}

Node* create(int data[], int n) {
    Node* root = newNode(data[0]);
    for(int i=1; i<n; i++) {
        insert(root, data[i]);
    }
    return root;
}

int flag=0, idx=0; // 非BST:0,前序:1,mirror:2
int data[1000];

void preOrder(Node* root) {
    if(root==nullptr){
        return;
    }
    if(root->data!=data[idx]) {
        return;
    }
    if(idx==n-1 && root->data==data[idx]) {
        flag=1;
        return;
    }
    idx++;
    preOrder(root->left);
    preOrder(root->right);
}

void preMirror(Node* root) {
    if(root==nullptr){
        return;
    }
    if(root->data!=data[idx]) {
        return;
    }
    if(idx==n-1 && root->data==data[idx]) {
        flag=2;
        return;
    }
    idx++;
    preMirror(root->right);
    preMirror(root->left);
}

void postOrder(Node* root) {
    if(root== nullptr){
        return;
    }
    if(flag==1) {
        postOrder(root->left);
        postOrder(root->right);
    } else {
        postOrder(root->right);
        postOrder(root->left);

    }
    idx--;
    if(idx<0) {
        cout<<root->data;
    } else {
        cout<<root->data<<' ';
    }
}

int main() {
//     fstream fin;
//     fin.open("tmp4.txt");
//     fin>>n;
//     for(int i=0; i<n; i++) {
//         fin>>data[i];
//     }
   cin>>n;
   for(int i=0; i<n; i++) {
       cin>>data[i];
   }

    Node* root=create(data, n);

    preOrder(root);
    preMirror(root);
    if(flag==0) {
        cout<<"NO";
    } else {
        cout<<"YES"<<endl;
        postOrder(root);
    }

}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
【Solution】 To convert a binary search tree into a sorted circular doubly linked list, we can use the following steps: 1. Inorder traversal of the binary search tree to get the elements in sorted order. 2. Create a doubly linked list and add the elements from the inorder traversal to it. 3. Make the list circular by connecting the head and tail nodes. 4. Return the head node of the circular doubly linked list. Here's the Python code for the solution: ``` class Node: def __init__(self, val): self.val = val self.prev = None self.next = None def tree_to_doubly_list(root): if not root: return None stack = [] cur = root head = None prev = None while cur or stack: while cur: stack.append(cur) cur = cur.left cur = stack.pop() if not head: head = cur if prev: prev.right = cur cur.left = prev prev = cur cur = cur.right head.left = prev prev.right = head return head ``` To verify the accuracy of the code, we can use the following test cases: ``` # Test case 1 # Input: [4,2,5,1,3] # Output: # Binary search tree: # 4 # / \ # 2 5 # / \ # 1 3 # Doubly linked list: 1 <-> 2 <-> 3 <-> 4 <-> 5 # Doubly linked list in reverse order: 5 <-> 4 <-> 3 <-> 2 <-> 1 root = Node(4) root.left = Node(2) root.right = Node(5) root.left.left = Node(1) root.left.right = Node(3) head = tree_to_doubly_list(root) print("Binary search tree:") print_tree(root) print("Doubly linked list:") print_list(head) print("Doubly linked list in reverse order:") print_list_reverse(head) # Test case 2 # Input: [2,1,3] # Output: # Binary search tree: # 2 # / \ # 1 3 # Doubly linked list: 1 <-> 2 <-> 3 # Doubly linked list in reverse order: 3 <-> 2 <-> 1 root = Node(2) root.left = Node(1) root.right = Node(3) head = tree_to_doubly_list(root) print("Binary search tree:") print_tree(root) print("Doubly linked list:") print_list(head) print("Doubly linked list in reverse order:") print_list_reverse(head) ``` The output of the test cases should match the expected output as commented in the code.
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值