Home
About
Blog
Products
Forum
Support
Contact
Sunbelt Computer Software
PL/B Language Development and Support
Home
About
Blog
Products
Forum
Support
Contact
JavaScript-Interview-Questions/trees/011.js at master · magee/JavaScript-Interview-Questions · GitHub
Skip to content
Navigation Menu
Sign in
Appearance settings
Platform
AI CODE CREATION
GitHub Copilot
Write better code with AI
GitHub Copilot app
Direct agents from issue to merge
MCP Registry
Integrate external tools
DEVELOPER WORKFLOWS
Actions
Automate any workflow
Codespaces
Instant dev environments
Issues
Plan and track work
Code Review
Manage code changes
Code Quality
Enforce quality at merge
APPLICATION SECURITY
GitHub Advanced Security
Find and fix vulnerabilities
Code security
Secure your code as you build
Secret protection
Stop leaks before they start
EXPLORE
Why GitHub
Documentation
Blog
Changelog
Marketplace
View all features
Solutions
BY COMPANY SIZE
Enterprises
Small and medium teams
Startups
Nonprofits
BY USE CASE
App Modernization
DevSecOps
DevOps
CI/CD
View all use cases
BY INDUSTRY
Healthcare
Financial services
Manufacturing
Government
View all industries
View all solutions
Resources
EXPLORE BY TOPIC
AI
Software Development
DevOps
Security
View all topics
EXPLORE BY TYPE
Customer stories
Events & webinars
Ebooks & reports
Business insights
GitHub Skills
SUPPORT & SERVICES
Documentation
Customer support
Community forum
Trust center
Partners
View all resources
Open Source
COMMUNITY
GitHub Sponsors
Fund open source developers
PROGRAMS
Security Lab
Maintainer Community
GitHub Stars
Archive Program
REPOSITORIES
Topics
Trending
Collections
Enterprise
ENTERPRISE SOLUTIONS
Enterprise platform
AI-powered developer platform
AVAILABLE ADD-ONS
GitHub Advanced Security
Enterprise-grade security features
Copilot for Business
Enterprise-grade AI features
Premium Support
Enterprise-grade 24/7 support
Pricing
Search
/
Sign in
Sign up
Appearance settings
You signed in with another tab or window.
Reload
to refresh your session.
You signed out in another tab or window.
Reload
to refresh your session.
You switched accounts on another tab or window.
Reload
to refresh your session.
Dismiss alert
{{ message }}
magee
/
JavaScript-Interview-Questions
Public
forked from
aishraj/JavaScript-Interview-Questions
Notifications
You must be signed in to change notification settings
Fork
0
Star
0
Code
Pull requests
0
Actions
Projects
Wiki
Security and quality
0
Insights
Additional navigation options
Code
Pull requests
Actions
Projects
Wiki
Security and quality
Insights
Files
Expand file tree
master
Breadcrumbs
JavaScript-Interview-Questions
/
trees
/
011.js
Copy path
Blame
More file actions
Blame
More file actions
Latest commit
History
History
History
127 lines (111 loc) · 2.51 KB
master
Breadcrumbs
JavaScript-Interview-Questions
/
trees
/
011.js
Copy path
Top
File metadata and controls
Code
Blame
127 lines (111 loc) · 2.51 KB
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
/*
* <!--
* This program is distributed under
* the terms of the MIT license.
* Please see the LICENSE file for details.
* -->
*/
/*
* Given two very large binary trees T1 (with millions of nodes),
* and T2 (with hundreds of nodes); create an algorithm to decide whether
* T2 is a subtree of T1.
*
*/
/*____________________________________________________________________________*/
/**
*
@function
{
public static
} isContainsTree
*
* Checks whether t1 contains t2.
*
*
@param
{
Node
} t1 - root node of the main tree.
*
@param
{
Node
} t2 - root node of the subtree.
*/
function
isContainsTree
(
t1
,
t2
)
{
if
(
!
t2
)
{
return
true
;
}
return
isSubTree
(
t1
,
t2
)
;
}
/**
*
@function
{
private static
} isSubTree
*
* Checks whether t1 contains t2.
*
*
@param
{
Node
} t1 - root node of the main tree.
*
@param
{
Node
} t2 - root node of the subtree.
*
*
@return
`true` if t2 is a subtree of t1, `false` otherwise.
*/
function
isSubTree
(
t1
,
t2
)
{
if
(
!
t1
)
{
return
false
;
}
if
(
t1
.
value
===
t2
.
value
)
{
if
(
isMatch
(
t1
,
t2
)
)
{
return
true
;
}
}
return
(
isSubTree
(
t1
.
left
,
t2
)
||
isSubTree
(
t1
.
right
,
t2
)
)
;
}
/**
*
@function
{
private static
} isSubTree
*
* Checks whether t1 and t2 are identical.
*
*
@param
{
Node
} t1 - root node of the first tree.
*
@param
{
Node
} t2 - root node of the second tree.
*
*
@return
`true` if t1 and t2 are identical in structure, `false` otherwise.
*/
function
isMatch
(
t1
,
t2
)
{
if
(
!
t2
&&
!
t1
)
{
return
true
;
}
if
(
t1
.
value
!==
t2
.
value
)
{
return
false
;
}
return
isMatch
(
t1
.
left
,
t2
.
left
)
&&
isMatch
(
t1
.
right
,
t2
.
right
)
;
}
/**
*
@class
{public} Node
*
* A typical binary tree node.
*
*
@param
{
Node
} left - the left node.
*
@param
{
Node
} right - the right node.
*
@param
{
Integer
} value - the value of this node.
*/
function
Node
(
left
,
right
,
value
)
{
this
.
left
=
left
;
this
.
right
=
right
;
this
.
value
=
value
;
}
/*____________________________________________________________________________*/
/*
* Sample tree structure.
*/
var
root1
=
new
Node
(
new
Node
(
new
Node
(
null
,
null
,
28
)
,
new
Node
(
null
,
null
,
79
)
,
62
)
,
new
Node
(
new
Node
(
new
Node
(
null
,
null
,
121
)
,
null
,
130
)
,
new
Node
(
null
,
null
,
190
)
,
141
)
,
110
)
;
var
root2
=
new
Node
(
new
Node
(
null
,
null
,
121
)
,
null
,
130
)
;
console
.
log
(
isContainsTree
(
root1
,
root2
)
)
;
/*
Output: ($ /usr/bin/node 011.js)
true
*/
You can’t perform that action at this time.
