Skip to content

Commit e7de9e5

Browse files
author
liwentian
committed
fd
1 parent 1004b5f commit e7de9e5

File tree

7 files changed

+400
-399
lines changed

7 files changed

+400
-399
lines changed

‎ebook/tree/Tree.aux‎

Lines changed: 86 additions & 86 deletions
Original file line numberDiff line numberDiff line change
@@ -65,102 +65,102 @@
6565
\@writefile{toc}{\contentsline {section}{\numberline {1.18}Count Complete Tree Nodes}{23}{section.1.18}}
6666
\@writefile{toc}{\contentsline {subsubsection}{Description}{23}{section*.43}}
6767
\@writefile{toc}{\contentsline {subsubsection}{Solution}{23}{section*.44}}
68-
\@writefile{toc}{\contentsline {section}{\numberline {1.19}Path Sum}{24}{section.1.19}}
68+
\@writefile{toc}{\contentsline {section}{\numberline {1.19}Construct Binary Tree from Preorder and Inorder Traversal}{24}{section.1.19}}
6969
\@writefile{toc}{\contentsline {subsubsection}{Description}{24}{section*.45}}
7070
\@writefile{toc}{\contentsline {subsubsection}{Solution}{24}{section*.46}}
71-
\@writefile{toc}{\contentsline {section}{\numberline {1.20}Construct Binary Tree from Preorder and Inorder Traversal}{25}{section.1.20}}
71+
\@writefile{toc}{\contentsline {section}{\numberline {1.20}Construct Binary Tree from Inorder and Postorder Traversal}{25}{section.1.20}}
7272
\@writefile{toc}{\contentsline {subsubsection}{Description}{25}{section*.47}}
7373
\@writefile{toc}{\contentsline {subsubsection}{Solution}{25}{section*.48}}
74-
\@writefile{toc}{\contentsline {section}{\numberline {1.21}Construct Binary Tree from Inorder and Postorder Traversal}{26}{section.1.21}}
74+
\@writefile{toc}{\contentsline {section}{\numberline {1.21}Path Sum}{26}{section.1.21}}
7575
\@writefile{toc}{\contentsline {subsubsection}{Description}{26}{section*.49}}
7676
\@writefile{toc}{\contentsline {subsubsection}{Solution}{26}{section*.50}}
7777
\@writefile{toc}{\contentsline {section}{\numberline {1.22}Path Sum II}{27}{section.1.22}}
7878
\@writefile{toc}{\contentsline {subsubsection}{Description}{27}{section*.51}}
7979
\@writefile{toc}{\contentsline {subsubsection}{Solution}{27}{section*.52}}
80-
\@writefile{toc}{\contentsline {section}{\numberline {1.23}Recover Binary Search Tree}{28}{section.1.23}}
80+
\@writefile{toc}{\contentsline {section}{\numberline {1.23}Path Sum III}{28}{section.1.23}}
8181
\@writefile{toc}{\contentsline {subsubsection}{Description}{28}{section*.53}}
82-
\@writefile{toc}{\contentsline {subsubsection}{Solution I}{28}{section*.54}}
83-
\@writefile{toc}{\contentsline {subsubsection}{Solution II}{29}{section*.55}}
84-
\@writefile{toc}{\contentsline {section}{\numberline {1.24}Binary Tree Paths}{30}{section.1.24}}
85-
\@writefile{toc}{\contentsline {subsubsection}{Description}{30}{section*.56}}
86-
\@writefile{toc}{\contentsline {subsubsection}{Solution}{30}{section*.57}}
87-
\@writefile{toc}{\contentsline {section}{\numberline {1.25}Flatten Binary Tree to Linked List}{31}{section.1.25}}
88-
\@writefile{toc}{\contentsline {subsubsection}{Description}{31}{section*.58}}
89-
\@writefile{toc}{\contentsline {subsubsection}{Solution I}{31}{section*.59}}
90-
\@writefile{toc}{\contentsline {subsubsection}{Solution II}{32}{section*.60}}
91-
\@writefile{toc}{\contentsline {section}{\numberline {1.26}Binary Tree Right Side View}{33}{section.1.26}}
92-
\@writefile{toc}{\contentsline {subsubsection}{Description}{33}{section*.61}}
93-
\@writefile{toc}{\contentsline {subsubsection}{Solution}{33}{section*.62}}
94-
\@writefile{toc}{\contentsline {section}{\numberline {1.27}Kth Smallest Element in a BST}{34}{section.1.27}}
95-
\@writefile{toc}{\contentsline {subsubsection}{Description}{34}{section*.63}}
96-
\@writefile{toc}{\contentsline {subsubsection}{Solution I}{34}{section*.64}}
97-
\@writefile{toc}{\contentsline {subsubsection}{Solution II}{34}{section*.65}}
98-
\@writefile{toc}{\contentsline {section}{\numberline {1.28}Binary Tree Preorder Traversal}{35}{section.1.28}}
99-
\@writefile{toc}{\contentsline {subsubsection}{Description}{35}{section*.66}}
100-
\@writefile{toc}{\contentsline {subsubsection}{Solution}{35}{section*.67}}
101-
\@writefile{toc}{\contentsline {section}{\numberline {1.29}Unique Binary Search Trees}{36}{section.1.29}}
102-
\@writefile{toc}{\contentsline {subsubsection}{Description}{36}{section*.68}}
103-
\@writefile{toc}{\contentsline {subsubsection}{Solution}{36}{section*.69}}
104-
\@writefile{toc}{\contentsline {section}{\numberline {1.30}Unique Binary Search Trees II}{37}{section.1.30}}
105-
\@writefile{toc}{\contentsline {subsubsection}{Description}{37}{section*.70}}
106-
\@writefile{toc}{\contentsline {subsubsection}{Solution}{37}{section*.71}}
107-
\@writefile{toc}{\contentsline {section}{\numberline {1.31}House Robber III}{38}{section.1.31}}
108-
\@writefile{toc}{\contentsline {subsubsection}{Description}{38}{section*.72}}
109-
\@writefile{toc}{\contentsline {subsubsection}{Solution}{38}{section*.73}}
110-
\@writefile{toc}{\contentsline {section}{\numberline {1.32}Binary Tree Inorder Traversal}{39}{section.1.32}}
111-
\@writefile{toc}{\contentsline {subsubsection}{Description}{39}{section*.74}}
112-
\@writefile{toc}{\contentsline {subsubsection}{Solution}{39}{section*.75}}
113-
\@writefile{toc}{\contentsline {section}{\numberline {1.33}Binary Tree Postorder Traversal}{40}{section.1.33}}
114-
\@writefile{toc}{\contentsline {subsubsection}{Description}{40}{section*.76}}
115-
\@writefile{toc}{\contentsline {subsubsection}{Solution}{40}{section*.77}}
116-
\@writefile{toc}{\contentsline {section}{\numberline {1.34}Minimum Depth of Binary Tree}{41}{section.1.34}}
117-
\@writefile{toc}{\contentsline {subsubsection}{Description}{41}{section*.78}}
118-
\@writefile{toc}{\contentsline {subsubsection}{Solution}{41}{section*.79}}
119-
\@writefile{toc}{\contentsline {section}{\numberline {1.35}Count Univalue Subtrees}{42}{section.1.35}}
120-
\@writefile{toc}{\contentsline {subsubsection}{Description}{42}{section*.80}}
121-
\@writefile{toc}{\contentsline {subsubsection}{Solution}{42}{section*.81}}
122-
\@writefile{toc}{\contentsline {section}{\numberline {1.36}Validate Binary Search Tree}{43}{section.1.36}}
123-
\@writefile{toc}{\contentsline {subsubsection}{Description}{43}{section*.82}}
124-
\@writefile{toc}{\contentsline {subsubsection}{Solution}{43}{section*.83}}
125-
\@writefile{toc}{\contentsline {section}{\numberline {1.37}Binary Tree Upside Down}{44}{section.1.37}}
126-
\@writefile{toc}{\contentsline {subsubsection}{Description}{44}{section*.84}}
127-
\@writefile{toc}{\contentsline {subsubsection}{Solution}{44}{section*.85}}
128-
\@writefile{toc}{\contentsline {section}{\numberline {1.38}Sum Root to Leaf Numbers}{45}{section.1.38}}
129-
\@writefile{toc}{\contentsline {subsubsection}{Description}{45}{section*.86}}
130-
\@writefile{toc}{\contentsline {subsubsection}{Solution}{45}{section*.87}}
131-
\@writefile{toc}{\contentsline {section}{\numberline {1.39}Inorder Successor in BST}{46}{section.1.39}}
132-
\@writefile{toc}{\contentsline {subsubsection}{Description}{46}{section*.88}}
133-
\@writefile{toc}{\contentsline {subsubsection}{Solution I}{46}{section*.89}}
134-
\@writefile{toc}{\contentsline {subsubsection}{Solution II}{46}{section*.90}}
135-
\@writefile{toc}{\contentsline {section}{\numberline {1.40}Binary Tree Longest Consecutive Sequence}{47}{section.1.40}}
136-
\@writefile{toc}{\contentsline {subsubsection}{Description}{47}{section*.91}}
137-
\@writefile{toc}{\contentsline {subsubsection}{Solution}{47}{section*.92}}
138-
\@writefile{toc}{\contentsline {section}{\numberline {1.41}Delete Node in a BST}{48}{section.1.41}}
139-
\@writefile{toc}{\contentsline {subsubsection}{Description}{48}{section*.93}}
140-
\@writefile{toc}{\contentsline {subsubsection}{Solution}{49}{section*.94}}
141-
\@writefile{toc}{\contentsline {section}{\numberline {1.42}Verify Preorder Sequence in Binary Search Tree}{50}{section.1.42}}
142-
\@writefile{toc}{\contentsline {subsubsection}{Description}{50}{section*.95}}
143-
\@writefile{toc}{\contentsline {subsubsection}{Solution}{50}{section*.96}}
144-
\@writefile{toc}{\contentsline {section}{\numberline {1.43}Closest Binary Search Tree Value}{51}{section.1.43}}
145-
\@writefile{toc}{\contentsline {subsubsection}{Description}{51}{section*.97}}
146-
\@writefile{toc}{\contentsline {subsubsection}{Solution I}{51}{section*.98}}
147-
\@writefile{toc}{\contentsline {subsubsection}{Solution II}{51}{section*.99}}
148-
\@writefile{toc}{\contentsline {section}{\numberline {1.44}Closest Binary Search Tree Value II}{52}{section.1.44}}
149-
\@writefile{toc}{\contentsline {subsubsection}{Description}{52}{section*.100}}
150-
\@writefile{toc}{\contentsline {subsubsection}{Analysis}{52}{section*.101}}
151-
\@writefile{toc}{\contentsline {subsubsection}{Solution I}{53}{section*.102}}
152-
\@writefile{toc}{\contentsline {subsubsection}{Solution II}{54}{section*.103}}
153-
\@writefile{toc}{\contentsline {section}{\numberline {1.45}Sum of Left Leaves}{55}{section.1.45}}
154-
\@writefile{toc}{\contentsline {subsubsection}{Description}{55}{section*.104}}
155-
\@writefile{toc}{\contentsline {subsubsection}{Solution I}{55}{section*.105}}
156-
\@writefile{toc}{\contentsline {subsubsection}{Solution II}{55}{section*.106}}
157-
\@writefile{toc}{\contentsline {section}{\numberline {1.46}Find Leaves of Binary Tree}{56}{section.1.46}}
158-
\@writefile{toc}{\contentsline {subsubsection}{Description}{56}{section*.107}}
159-
\@writefile{toc}{\contentsline {subsubsection}{Solution}{56}{section*.108}}
160-
\@writefile{toc}{\contentsline {section}{\numberline {1.47}Path Sum III}{57}{section.1.47}}
161-
\@writefile{toc}{\contentsline {subsubsection}{Description}{57}{section*.109}}
162-
\@writefile{toc}{\contentsline {subsubsection}{Solution I}{58}{section*.110}}
163-
\@writefile{toc}{\contentsline {subsubsection}{Solution II}{59}{section*.111}}
82+
\@writefile{toc}{\contentsline {subsubsection}{Solution I}{29}{section*.54}}
83+
\@writefile{toc}{\contentsline {subsubsection}{Solution II}{30}{section*.55}}
84+
\@writefile{toc}{\contentsline {section}{\numberline {1.24}Recover Binary Search Tree}{31}{section.1.24}}
85+
\@writefile{toc}{\contentsline {subsubsection}{Description}{31}{section*.56}}
86+
\@writefile{toc}{\contentsline {subsubsection}{Solution I}{31}{section*.57}}
87+
\@writefile{toc}{\contentsline {subsubsection}{Solution II}{32}{section*.58}}
88+
\@writefile{toc}{\contentsline {section}{\numberline {1.25}Binary Tree Paths}{33}{section.1.25}}
89+
\@writefile{toc}{\contentsline {subsubsection}{Description}{33}{section*.59}}
90+
\@writefile{toc}{\contentsline {subsubsection}{Solution}{33}{section*.60}}
91+
\@writefile{toc}{\contentsline {section}{\numberline {1.26}Flatten Binary Tree to Linked List}{34}{section.1.26}}
92+
\@writefile{toc}{\contentsline {subsubsection}{Description}{34}{section*.61}}
93+
\@writefile{toc}{\contentsline {subsubsection}{Solution I}{34}{section*.62}}
94+
\@writefile{toc}{\contentsline {subsubsection}{Solution II}{35}{section*.63}}
95+
\@writefile{toc}{\contentsline {section}{\numberline {1.27}Binary Tree Right Side View}{36}{section.1.27}}
96+
\@writefile{toc}{\contentsline {subsubsection}{Description}{36}{section*.64}}
97+
\@writefile{toc}{\contentsline {subsubsection}{Solution}{36}{section*.65}}
98+
\@writefile{toc}{\contentsline {section}{\numberline {1.28}Kth Smallest Element in a BST}{37}{section.1.28}}
99+
\@writefile{toc}{\contentsline {subsubsection}{Description}{37}{section*.66}}
100+
\@writefile{toc}{\contentsline {subsubsection}{Solution I}{37}{section*.67}}
101+
\@writefile{toc}{\contentsline {subsubsection}{Solution II}{37}{section*.68}}
102+
\@writefile{toc}{\contentsline {section}{\numberline {1.29}Unique Binary Search Trees}{38}{section.1.29}}
103+
\@writefile{toc}{\contentsline {subsubsection}{Description}{38}{section*.69}}
104+
\@writefile{toc}{\contentsline {subsubsection}{Solution}{38}{section*.70}}
105+
\@writefile{toc}{\contentsline {section}{\numberline {1.30}Unique Binary Search Trees II}{39}{section.1.30}}
106+
\@writefile{toc}{\contentsline {subsubsection}{Description}{39}{section*.71}}
107+
\@writefile{toc}{\contentsline {subsubsection}{Solution}{39}{section*.72}}
108+
\@writefile{toc}{\contentsline {section}{\numberline {1.31}House Robber III}{40}{section.1.31}}
109+
\@writefile{toc}{\contentsline {subsubsection}{Description}{40}{section*.73}}
110+
\@writefile{toc}{\contentsline {subsubsection}{Solution}{40}{section*.74}}
111+
\@writefile{toc}{\contentsline {section}{\numberline {1.32}Binary Tree Preorder Traversal}{41}{section.1.32}}
112+
\@writefile{toc}{\contentsline {subsubsection}{Description}{41}{section*.75}}
113+
\@writefile{toc}{\contentsline {subsubsection}{Solution}{41}{section*.76}}
114+
\@writefile{toc}{\contentsline {section}{\numberline {1.33}Binary Tree Inorder Traversal}{42}{section.1.33}}
115+
\@writefile{toc}{\contentsline {subsubsection}{Description}{42}{section*.77}}
116+
\@writefile{toc}{\contentsline {subsubsection}{Solution}{42}{section*.78}}
117+
\@writefile{toc}{\contentsline {section}{\numberline {1.34}Binary Tree Postorder Traversal}{43}{section.1.34}}
118+
\@writefile{toc}{\contentsline {subsubsection}{Description}{43}{section*.79}}
119+
\@writefile{toc}{\contentsline {subsubsection}{Solution}{43}{section*.80}}
120+
\@writefile{toc}{\contentsline {section}{\numberline {1.35}Minimum Depth of Binary Tree}{44}{section.1.35}}
121+
\@writefile{toc}{\contentsline {subsubsection}{Description}{44}{section*.81}}
122+
\@writefile{toc}{\contentsline {subsubsection}{Solution}{44}{section*.82}}
123+
\@writefile{toc}{\contentsline {section}{\numberline {1.36}Count Univalue Subtrees}{45}{section.1.36}}
124+
\@writefile{toc}{\contentsline {subsubsection}{Description}{45}{section*.83}}
125+
\@writefile{toc}{\contentsline {subsubsection}{Solution}{45}{section*.84}}
126+
\@writefile{toc}{\contentsline {section}{\numberline {1.37}Validate Binary Search Tree}{46}{section.1.37}}
127+
\@writefile{toc}{\contentsline {subsubsection}{Description}{46}{section*.85}}
128+
\@writefile{toc}{\contentsline {subsubsection}{Solution}{46}{section*.86}}
129+
\@writefile{toc}{\contentsline {section}{\numberline {1.38}Binary Tree Upside Down}{47}{section.1.38}}
130+
\@writefile{toc}{\contentsline {subsubsection}{Description}{47}{section*.87}}
131+
\@writefile{toc}{\contentsline {subsubsection}{Solution}{47}{section*.88}}
132+
\@writefile{toc}{\contentsline {section}{\numberline {1.39}Sum Root to Leaf Numbers}{48}{section.1.39}}
133+
\@writefile{toc}{\contentsline {subsubsection}{Description}{48}{section*.89}}
134+
\@writefile{toc}{\contentsline {subsubsection}{Solution}{48}{section*.90}}
135+
\@writefile{toc}{\contentsline {section}{\numberline {1.40}Inorder Successor in BST}{49}{section.1.40}}
136+
\@writefile{toc}{\contentsline {subsubsection}{Description}{49}{section*.91}}
137+
\@writefile{toc}{\contentsline {subsubsection}{Solution I}{49}{section*.92}}
138+
\@writefile{toc}{\contentsline {subsubsection}{Solution II}{49}{section*.93}}
139+
\@writefile{toc}{\contentsline {section}{\numberline {1.41}Binary Tree Longest Consecutive Sequence}{50}{section.1.41}}
140+
\@writefile{toc}{\contentsline {subsubsection}{Description}{50}{section*.94}}
141+
\@writefile{toc}{\contentsline {subsubsection}{Solution}{50}{section*.95}}
142+
\@writefile{toc}{\contentsline {section}{\numberline {1.42}Delete Node in a BST}{51}{section.1.42}}
143+
\@writefile{toc}{\contentsline {subsubsection}{Description}{51}{section*.96}}
144+
\@writefile{toc}{\contentsline {subsubsection}{Solution}{52}{section*.97}}
145+
\@writefile{toc}{\contentsline {section}{\numberline {1.43}Verify Preorder Sequence in Binary Search Tree}{53}{section.1.43}}
146+
\@writefile{toc}{\contentsline {subsubsection}{Description}{53}{section*.98}}
147+
\@writefile{toc}{\contentsline {subsubsection}{Solution}{53}{section*.99}}
148+
\@writefile{toc}{\contentsline {section}{\numberline {1.44}Closest Binary Search Tree Value}{54}{section.1.44}}
149+
\@writefile{toc}{\contentsline {subsubsection}{Description}{54}{section*.100}}
150+
\@writefile{toc}{\contentsline {subsubsection}{Solution I}{54}{section*.101}}
151+
\@writefile{toc}{\contentsline {subsubsection}{Solution II}{54}{section*.102}}
152+
\@writefile{toc}{\contentsline {section}{\numberline {1.45}Closest Binary Search Tree Value II}{55}{section.1.45}}
153+
\@writefile{toc}{\contentsline {subsubsection}{Description}{55}{section*.103}}
154+
\@writefile{toc}{\contentsline {subsubsection}{Analysis}{55}{section*.104}}
155+
\@writefile{toc}{\contentsline {subsubsection}{Solution I}{56}{section*.105}}
156+
\@writefile{toc}{\contentsline {subsubsection}{Solution II}{57}{section*.106}}
157+
\@writefile{toc}{\contentsline {section}{\numberline {1.46}Sum of Left Leaves}{58}{section.1.46}}
158+
\@writefile{toc}{\contentsline {subsubsection}{Description}{58}{section*.107}}
159+
\@writefile{toc}{\contentsline {subsubsection}{Solution I}{58}{section*.108}}
160+
\@writefile{toc}{\contentsline {subsubsection}{Solution II}{58}{section*.109}}
161+
\@writefile{toc}{\contentsline {section}{\numberline {1.47}Find Leaves of Binary Tree}{59}{section.1.47}}
162+
\@writefile{toc}{\contentsline {subsubsection}{Description}{59}{section*.110}}
163+
\@writefile{toc}{\contentsline {subsubsection}{Solution}{59}{section*.111}}
164164
\@writefile{toc}{\contentsline {section}{\numberline {1.48}Largest BST Subtree}{60}{section.1.48}}
165165
\@writefile{toc}{\contentsline {subsubsection}{Description}{60}{section*.112}}
166166
\@writefile{toc}{\contentsline {subsubsection}{Solution}{60}{section*.113}}

0 commit comments

Comments
 (0)