二叉树
多一些不为什么的坚持
qq:1216161552
展开
-
1099. Build A Binary Search Tree (30) <BST树>
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原创 2017-07-29 17:49:53 · 366 阅读 · 0 评论 -
1102. Invert a Binary Tree (25)<反转二叉树>
The following is from Max Howell @twitter:Google: 90% of our engineers use the software you wrote (Homebrew), but you can't invert a binary tree on a whiteboard so fuck off.Now it's your turn原创 2017-07-30 21:37:36 · 253 阅读 · 0 评论 -
1106. Lowest Price in Supply Chain (25) DFS,BFS
A supply chain is a network of retailers(零售商), distributors(经销商), and suppliers(供应商)-- everyone involved in moving a product from supplier to customer.Starting from one root supplier, everyone on原创 2017-07-31 21:07:58 · 216 阅读 · 0 评论 -
1110. Complete Binary Tree (25) <完全二叉树>
Given a tree, you are supposed to tell if it is a complete binary tree.Input Specification:Each input file contains one test case. For each case, the first line gives a positive integer N (<=2原创 2017-08-02 22:56:40 · 231 阅读 · 0 评论 -
*1115. Counting Nodes in a BST (30) <二叉搜索树>
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 or equal to the node's ke原创 2017-08-03 12:56:43 · 254 阅读 · 0 评论 -
1086. Tree Traversals Again (25) <二叉树的建立>
An inorder binary tree traversal can be implemented in a non-recursive way with a stack. For example, suppose that when a 6-node binary tree (with the keys numbered from 1 to 6) is traversed, the stac原创 2017-07-27 12:47:04 · 255 阅读 · 0 评论 -
1127. ZigZagging on a Tree (30) 根据中+后输出层序遍历
Suppose that all the keys in a binary tree are distinct positive integers. A unique binary tree can be determined by a given pair of postorder and inorder traversal sequences. And it is a simple stand原创 2017-11-13 22:01:12 · 270 阅读 · 0 评论 -
1135. Is It A Red-Black Tree (30) 红黑树
There is a kind of balanced binary search tree named red-black tree in the data structure. It has the following 5 properties:(1) Every node is either red or black.(2) The root is black.(3) Eve原创 2017-11-20 19:55:11 · 344 阅读 · 0 评论 -
已知树的中序+后序/先序遍历,建立二叉树
已知树的中序和后序遍历,建立二叉树(个人感觉理解不了可以直接硬记,慢慢就能理解,知道思想不能理解也无所谓,会用就行)#include#include#include#includeusing namespace std;int n;int hou[50];int zhong[50];typedef struct Btree{ int data; str原创 2017-04-07 12:02:06 · 699 阅读 · 0 评论