@@ -576,7 +576,7 @@ function union_set(set1, set2) {
576576 (else (element-of-set? x (cdr set)))))
577577 </SCHEME >
578578 <JAVASCRIPT >
579- function is_element_of_set(x,set) {
579+ function is_element_of_set(x,  set) {
580580 return is_null(set) 
581581 ? false
582582 : x === head(set)
@@ -925,7 +925,7 @@ function left_branch(tree) { return head(tail(tree)); }
925925function right_branch(tree) { return head(tail(tail(tree))); }
926926<SHORT_SPACE />
927927function make_tree(entry, left, right) { 
928-  return list(entry,left,right);
928+  return list(entry,  left,  right);
929929}
930930 </JAVASCRIPT >
931931 </SNIPPET >
@@ -950,7 +950,7 @@ entry(
950950 make_tree(10,
951951 null,
952952 make_tree(30,
953-  make_tree(20,null,null),
953+  make_tree(20,  null,  null),
954954 null)))));
955955 </JAVASCRIPT >
956956 </SNIPPET >
@@ -1052,7 +1052,7 @@ head(tail(head(tail(adjoin_set(10, adjoin_set(15, adjoin_set(20, null)))))));
10521052 (adjoin-set x (right-branch set))))))
10531053 </SCHEME >
10541054 <JAVASCRIPT >
1055- function adjoin_set(x,set) {
1055+ function adjoin_set(x,  set) {
10561056 return is_null(set)
10571057 ? make_tree(x, null, null)
10581058 : x === entry(set)
@@ -1339,11 +1339,11 @@ function tree_to_list_2(tree) {
13391339 </SCHEME >
13401340 <JAVASCRIPT >
13411341function list_to_tree(elements) {
1342-  return head(partial_tree(elements,length(elements)));
1342+  return head(partial_tree(elements,  length(elements)));
13431343}
13441344function partial_tree(elts, n) {
13451345 if (n === 0) {
1346-  return pair(null,elts);
1346+  return pair(null,  elts);
13471347 } else {
13481348 const left_size = math_floor((n - 1) / 2);
13491349 const left_result = partial_tree(elts, left_size);
0 commit comments