1043. Is It a Binary Search Tree

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.

Input Specification:

Each input file contains one test case. For each case, the first line contains a positive integer N (<=1000). Then N integer keys are given in the next line. All the numbers in a line are separated by a space.

Output Specification:

For each test case, first print in a line "YES" if the sequence is the preorder traversal sequence of a BST or the mirror image of a BST, or "NO" if not. Then if the answer is "YES", print in the next line the postorder traversal sequence of that tree. All the numbers in a line must be separated by a space, and there must be no extra space at the end of the line.


重新回来写这题,还是会忘记&

#include <stdio.h>
#include <stdlib.h>
#include <vector>
using namespace std;
typedef struct Node
{
        int id;
        struct Node *left,*right;
        }Node;
int n;
vector<int> init,pre,prem,post,postm;

void Post (Node * root,vector<int> &post)
{
     if( root==NULL) return ;
     Post(root->left,post);
     Post(root->right,post);
     post.push_back(root->id);
     }
void Postm (Node * root,vector<int> &postm)
{
     if( root==NULL) return ;
     Postm(root->right,postm);
     Postm(root->left,postm);
     postm.push_back(root->id);
     }
void Pre (Node * root,vector<int> &pre)
{
     if( root==NULL) return;
     pre.push_back(root->id);
     Pre(root->left,pre);
     Pre(root->right,pre);
     }
void Prem (Node * root,vector<int> &prem)
{
     if( root==NULL) return;
     prem.push_back(root->id);
     Prem(root->right,prem);
     Prem(root->left,prem);
     }
void Insert (Node * &root,int a)
{
     if( root==NULL)
     {
         root=new Node;
         root->id=a;
         root->left=NULL;
         root->right=NULL;
         return ;
         }
     if( a<root->id) Insert(root->left,a);
     else Insert(root->right,a);
     }

Node * Creat (vector<int> init)
{
     Node *root=new Node;
     root->id=init[0];
     root->left=NULL;
     root->right=NULL;
     for( int i=1;i<init.size();i++) Insert(root,init[i]);
     return root;
     }

int main ()
{
    scanf("%d",&n);
    int i,temp;
    for( i=0;i<n;i++)
    {
         scanf("%d",&temp);
         init.push_back(temp);
         }
    Node *root=Creat(init);
    Pre(root,pre);
    if( pre==init)
    {
        printf("YES\n");
        Post(root,post);
        printf("%d",post[0]);
        for( i=1;i<post.size();i++) printf(" %d",post[i]);
        }
    else 
    {
         Prem(root,prem);
         if( prem==init)
         {
             printf("YES\n");
             Postm(root,postm);
             printf("%d",postm[0]);
             for( i=1;i<postm.size();i++) printf(" %d",postm[i]);
             }
         else printf("NO\n");
         }
    system("pause");
    return 0;
    }


  • 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、付费专栏及课程。

余额充值